- tolerance chain graphs

نویسنده

  • J. Lehel
چکیده

Jacobson, MS., J. Lehel and L.M. Lesniak, @threshold and $-tolerance chain graphs, Discrete Applied Mathematics 44 (1993) 191-203. In this paper we introduce a class of graphs called $-threshold graphs which generalize threshold graphs. These graphs are studied for various functions I+? that include “max” and “min” as special cases. The graphs are then shown to fit into the more general setting of @tolerance intersection graphs previously introduced by Jacobson, McMorris, and Mulder. Finally, @-tolerance chain graphs are studied for the same functions @ mentioned above.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetry of Extended Representations of Mix Graphs and Sum-Product Graphs

This paper is concerned with two classes of graphs that generalize φ-tolerance chain graphs using the rank tolerance model introduced by Golumbic and Jamison in [3]. In a rank-tolerance representation of a graph, each vertex is assigned two parameters: a rank, which represents the size of that vertex, and a tolerance which represents an allowed extent of conflict with other vertices. Two vertic...

متن کامل

Rank-tolerance graph classes

In this paper we introduce certain classes of graphs that generalize φ-tolerance chain graphs. In a rank-tolerance representation of a graph, each vertex is assigned two parameters: a rank, which represents the size of that vertex, and a tolerance which represents an allowed extent of conflict with other vertices. Two vertices are adjacent if and only if their joint rank exceeds (or equals) the...

متن کامل

Application of n-distance balanced graphs in distributing management and finding optimal logistical hubs

Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...

متن کامل

Markov Chain Methods For Analyzing Complex Transport Networks

We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the use of the Markov chains defined on the graph representations of transport networks allowing for the effective network design, network performance evaluation, embedding, partitioning, and network fault tolerance analy...

متن کامل

Relating threshold tolerance graphs to other graph classes

A graph G = (V, E) is a threshold tolerance if it is possible to associate weights and tolerances with each node of G so that two nodes are adjacent exactly when the sum of their weights exceeds either one of their tolerances. Threshold tolerance graphs are a special case of the well-known class of tolerance graphs and generalize the class of threshold graphs which are also extensively studied ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001